Chain Shape Matching for Simulating Complex Hairstyles

نویسندگان

  • Witawat Rungjiratananon
  • Yoshihiro Kanamori
  • Tomoyuki Nishita
چکیده

Animations of hair dynamics greatly enrich the visual attractiveness of human characters. Traditional simulation techniques handle hair as clumps or continuum for efficiency; however, the visual quality is limited because they cannot represent the fine-scale motion of individual hair strands. Although a recent mass-spring approach tackled the problem of simulating the dynamics of every strand of hair, it required a complicated setting of springs and suffered from high computational cost. In this paper, we base the animation of hair on such a fine-scale on Lattice Shape Matching (LSM), which has been successfully used for simulating deformable objects. Our method regards each strand of hair as a chain of particles, and computes geometrically derived forces for the chain based on shape matching. Each chain of particles is simulated as an individual strand of hair. Our method can easily handle complex hairstyles such as curly or afro styles in a numerically stable way. While our method is not physically based, our GPU-based simulator achieves visually plausible animations consisting of several tens of thousands of hair strands at interactive rates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accurate, Robust and Structure-Aware Hair Capture

Hair is one of human’s most distinctive features and one important component in digital human models. However, capturing high quality hair models from real hairstyles remains di cult because of the challenges arising from hair’s unique characteristics: the view-dependent specular appearance, the geometric complexity and the high variability of real hairstyles. In this thesis, we address these c...

متن کامل

Real-time simulation of large elasto-plastic deformation with shape matching

Shape matching is a popular method for simulating deformable objects in real time as it is fast and stable at large time steps. Although shape matching can simulate large elastic deformation and ductile fracturing, until now, they are limited to scenarios with relatively small plastic deformation. In this work, we present a method for simulating deformable solids undergoing large plastic deform...

متن کامل

Robust shape-matching criterion for precision tracking of moving objects in correlated image sequences - Electronics Letters

A robust shape-matching measure with a boundary detection preprocessor is proposed to track a moving object in complex image sequences. A correlation-tracking algorithm seeks to align the incoming target image with the reference image of the target. But it has a critical problem if we use the conventional block-matching criteria. This is the so-called ‘false peak problem’, which is generally ca...

متن کامل

Human Modelling and Animation

This report brings attendees up-to-date on the frontiers of research in human modeling, animation, and rendering. Research in this area implies the development of numerous techniques: improving the physical aspects (shapes, colors, textures) of the actors, improving the deformation of limbs during motion, improving facial expressions and deformations, specifying tasks to be performed using natu...

متن کامل

Real-Time Interaction Techniques for Meshless Deformation Based on Shape Matching

Meshless deformation based on shape matching is a new technique for simulating deformable objects which handles point-based objects and does not need connectivity information. The technique has been first presented in 2005 and is of interest to all fields which require fast, stable simulations which do not need to be physically correct. In particular the technique seems very suitable for use in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2010